Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
نویسندگان
چکیده
منابع مشابه
Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
Many cryptographic protocols derive their security from the apparent computational intractability of the integer factorization problem. Currently, the best known integer-factoring algorithms run in subexponential time. Efficient parallel implementations of these algorithms constitute an important area of practical research. Most reported implementations use multi-core and/or distributed paralle...
متن کاملSIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
The best known integer-factoring algorithms consist of two stages: the sieving stage and the linear-algebra stage. Efficient parallel implementations of both these stages have been reported in the literature. All these implementations are based on multi-core or distributed parallelization. In this paper, we experimentally demonstrate that SIMD instructions available in many modern processors ca...
متن کاملInteger Factoring
Using simple examples and informal discussions this article surveys the key ideas and major advances of the last quarter century in integer factorization.
متن کاملFactoring Out Assumptions to Speed Up MUS Extraction
In earlier work on a limited form of extended resolution for CDCL based SAT solving, new literals were introduced to factor out parts of learned clauses. The main goal was to shorten clauses, reduce proof size and memory usage and thus speed up propagation and conflict analysis. Even though some reduction was achieved, the effectiveness of this technique was rather modest for generic SAT solvin...
متن کاملFactoring Integers Using SIMD Sieves
We describe our single-instruction multiple data (SIMD) implementation of the multiple polynomial quadratic sieve integer factoring algorithm. On a 16K MasPar massively parallel computer, our implementation can factor 100 digit integers in a few days. Its most notable success was the factorization of the 110-digit RSA-challenge number, which took about a month.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2017
ISSN: 0096-3003
DOI: 10.1016/j.amc.2016.08.019